Batch Range Proof for Practical Small Ranges
نویسندگان
چکیده
منابع مشابه
Mechanism Discrimination for Bimolecular Reactions: Revisited with a Practical Hydrogenation Case Study
The governing mechanism of surface reactions is a fundamental concern in heterogeneous catalysis. The Langmuir–Hinshelwood (LH) mechanism is widely accepted to control the surface reactions in many catalytic systems. This contribution derives and compares several important surface rate equations to evaluate their quality of fitting to the experimental data collected for a vapor-phase hydrogenat...
متن کاملPractical zero-knowledge protocols based on the discrete logarithm assumption
Zero-knowledge proofs were introduced by Goldwasser, Micali, and Rackoff. A zero-knowledge proof allows a prover to demonstrate knowledge of some information, for example that they know an element which is a member of a list or which is not a member of a list, without disclosing any further information about that element. Existing constructions of zero-knowledge proofs which can be applied to a...
متن کاملBatch Proofs of Partial Knowledge
We present a practical attack on the soundness of Peng and Bao’s ‘batch zero-knowledge proof and verification’ protocol for proving knowledge and equality of one-out-of-n pairs of discrete logarithms. Fixing the protocol seems to require a commitment scheme with a nonstandard, mercurial-esque binding property: the prover commits to just n− 1 values, but later opens the commitment to n values wi...
متن کاملThe square root law of steganographic capacity for Markov covers
It is a well-established result that steganographic capacity of perfectly secure stegosystems grows linearly with the number of cover elements—secure steganography has a positive rate. In practice, however, neither the Warden nor the Steganographer has perfect knowledge of the cover source and thus it is unlikely that perfectly secure stegosystems for complex covers, such as digital media, will...
متن کاملA new security proof for FMNV continuous non-malleable encoding scheme
A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010